An Algorithmic Approach for Computing Unions and Intersections Between Fuzzy Multisets
نویسندگان
چکیده
منابع مشابه
An algorithmic approach for fuzzy inference
To apply fuzzy logic, two major tasks need to be performed: the derivation of production rules and the determination of membership functions. These tasks are often difficult and time consuming. This paper presents an algorithmic method for generating membership functions and fuzzy production rules; the method includes an entropy minimization for screening analog values. Membership functions are...
متن کاملan application of fuzzy logic for car insurance underwriting
در ایران بیمه خودرو سهم بزرگی در صنعت بیمه دارد. تعیین حق بیمه مناسب و عادلانه نیازمند طبقه بندی خریداران بیمه نامه براساس خطرات احتمالی آنها است. عوامل ریسکی فراوانی می تواند بر این قیمت گذاری تاثیر بگذارد. طبقه بندی و تعیین میزان تاثیر گذاری هر عامل ریسکی بر قیمت گذاری بیمه خودرو پیچیدگی خاصی دارد. در این پایان نامه سعی در ارائه راهی جدید برای طبقه بندی عوامل ریسکی با استفاده از اصول و روش ها...
Compressed bitmap indexes: beyond unions and intersections
Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR, NOT) that are ideally suited for bitmaps. However, it is less obvious how to apply bitmaps to more advanced queries. For example, we might seek products in a store that meet some, but maybe not a...
متن کاملFuzzy Multisets and Their Generalizations
Fuzzymultisets with infinitemembership sequences and their generalization using set-valued memberships are considered. Two metric spaces of the infinite fuzzy multisets are defined in terms of cardinality. One is the completion of fuzzy multisets of finite membership sequences; the other is derived from operations among fuzzy multisets and realvalued multisets. Theoretical properties of these i...
متن کاملUnions and Intersections of Leray Complexes
A simplicial complex X is d-Leray if H̃i(Y ;Q) = 0 for all induced subcomplexes Y ⊂ X and i ≥ d. Let L(X) denote the minimal d such that X is d-Leray. Theorem: Let X,Y be simplicial complexes on the same vertex set. Then L(X ∩ Y ) ≤ L(X) + L(Y ) , L(X ∪ Y ) ≤ L(X) + L(Y ) + 1 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2019
ISSN: 1875-6883
DOI: 10.2991/ijcis.d.190724.001